A Hybrid Tabu Search and Constraint
نویسندگان
چکیده
6 This paper introduces a hybrid algorithm for the dynamic dial-a-ride problem in which 7 service requests arrive in real time. The hybrid algorithm combines an exact constraint 8 programming algorithm and a tabu search heuristic. An important component of the tabu 9 search heuristic consists of three scheduling procedures which are executed sequentially. 10 Experiments show that the constraint programming algorithm is sometimes able to accept 11 or reject incoming requests, and that the hybrid method outperforms each of the two 12 algorithms when they are executed alone. 13
منابع مشابه
Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملA Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
This paper introduces a hybrid algorithm for the dynamic dial-a-ride problem in which service requests arrive in real time. The hybrid algorithm combines an exact constraint programming algorithm and a tabu search heuristic. An important component of the tabu search heuristic consists of three scheduling procedures which are executed sequentially. Experiments show that the constraint programmin...
متن کاملA Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
Since their introduction, local search algorithms – and in particular tabu search algorithms – have consistently represented the state-of-the-art in solution techniques for the classical job-shop scheduling problem. This is despite the availability of powerful search and inference techniques for scheduling problems developed by the constraint programming community. In this paper, we introduce a...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملCombining Constraint Programming and Local Search for Job-Shop Scheduling
Since their introduction, local search algorithms have consistently represented the state-ofthe-art in solution techniques for the classical job-shop scheduling problem. This is despite the availability of powerful search and inference techniques for scheduling problems developed by the constraint programming community. In this paper, we introduce a simple hybrid algorithm for job-shop scheduli...
متن کامل